First-Order Definability of Transition Structures
نویسندگان
چکیده
منابع مشابه
Definability by Programs in First-Order Structures
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ti 1. Preliminarv detinitilms and results . . . . . . . . . . . . . . . . . . . . . . . . . Algebraic characterizations of the unwind property .................. A structure with the unwind property for every iterative (but not every recursive 1 program . The truth-table property ............................. Struc...
متن کاملFunctional first order definability of LRTP
The language LRTp is a non-deterministic language for exact real number computation. It has been shown that all computable first order relations in the sense of Brattka are definable in the language. If we restrict the language to single-valued total relations (e.g. functions), all polynomials are definable in the language. This paper is an expanded version of [12] in which we show that the non...
متن کاملFirst-Order Logic Definability of Free Languages
Operator Precedence Grammars (OPGs) define a deterministic class of context-free languages, which extend input-driven languages and still enjoy many properties: they are closed w.r.t. Boolean operations, concatenation and Kleene star; the emptiness problem is decidable; they are recognized by a suitable model of pushdown automaton; they can be characterized in terms of a monadic second-order lo...
متن کاملFunctional first order de definability of LRTp
The language LRTp is a non-deterministic language for exact real number computation. It has been shown that all computable first order relations in the sense of Brattka are definable in the language. If we restrict the language to single-valued total relations (e.g. functions), all polynomials are definable in the language. In this paper we show that the non-deterministic version of the limit o...
متن کاملA definability theorem for first order logic
In this paper, we will present a definability theorem for first order logic. This theorem is very easy to state, and its proof only uses elementary tools. To explain the theorem, let us first observe that if M is a model of a theory T in a language L, then, clearly, any definable subset S ⊂ M (i.e., a subset S = {a | M |= φ(a)} defined by some formula φ) is invariant under all automorphisms of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic, Language and Information
سال: 2018
ISSN: 0925-8531,1572-9583
DOI: 10.1007/s10849-018-9276-4